Traveling Salesman-Based Curve Reconstruction in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Traveling Salesman-Based Curve Reconstruction in Polynomial Time
An instance of the curve reconstruction problem is a finite sample set V of an unknown collection of curves γ. The task is to connect the points in V in the order in which they lie on γ. Giesen [Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SCG ’99), 1999, pp. 207–216] showed recently that the traveling salesman tour of V solves the reconstruction problem for single cl...
متن کاملCurve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem
Abstract. Given a nite set of points sampled from a curve, we want to reconstruct the ordering of the points along the curve. Every ordering of the sample points can be de ned by a polygon through these points. We show that for simple, regular curves Traveling Salesman Paths give the correct polygonal reconstruction, provided the points are sampled densely enough. In this case the polygonal rec...
متن کاملPolynomial Time Approximation Schemes for the Euclidean Traveling Salesman Problem
In this report, we aim to understand the key ideas and major techniques used in the assigned paper "Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems" by Sanjeev Arora. We also provide a review of related literature with an emphasis on the concurrent work by Joseph S. B. Mitchell. One presentation topic is selected from Arora’s paper and the oth...
متن کاملA Polynomial Time Algorithm for The Traveling Salesman Problem
The ATSP polytope can be expressed by asymmetric polynomial size linear program. Introduction In his seminal work [1], M. Yannakakis proved that the Traveling Salesman problem (TSP) polytope cannot be expressed by symmetric polynomial size linear program, where symmetry means that the polytope is an invariant under vertex relabeling. The question about the size of asymmetric linear programs was...
متن کاملThe Euclidean Traveling Salesman Problem and a Space-filling Curve
We elucidate the relationship between space-llling curves and the Euclidean Traveling 2 Salesman Problem (TSP) by reference to a particular space-lling curve whose scaling behaviour is strongly related to the conjectured scaling behaviour of the optimal TSP tour. We suggest that space-lling curves can be used to generate testbed TSPs: sets of points which in the limit cover a planar surface and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2001
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539700366115